Sponsored Search and the Exploration-Exploitation-Outsourcing Dilemma

نویسندگان

  • Michael Kearns
  • Jennifer Wortman
چکیده

Motivated by the recently proposed (and eventually abandoned) partnership in sponsored search advertising between Yahoo! and Google, we examine a model for ad selection in which an agent must balance directly learning which ads perform best and outsourcing ad slots to another party in exchange for a share of any click revenue. Our framework captures a fundamental tension between the potential shortterm revenue gains from outsourcing, and the longer-term impacts on revenue due to the outsourced learning opportunities. Our main result shows that for broad classes of distributions over the arriving keyphrases (including the heavytailed distributions consistent with empirical search data), an outsourcing policy optimized for near-term revenue maximization always results in lower long-term revenue than a pure learning, no-outsourcing approach, and on a time scale not much longer than the outsourcing period itself.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Outsourcing Manufacturing – an Analysis of a Learning Dilemma

This paper presents the results from a pilot study in which the consequences of outsourcing manufacturing on companies’ competence and their ability to develop lasting competitiveness are discussed. Based on a literature study and five case studies the analysis shows that outsourcing of manufacturing engenders a dilemma for many engineering companies, regarding the balance between learning from...

متن کامل

Augmented Downhill Simplex a Modified Heuristic Optimization Method

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

متن کامل

SYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES

In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...

متن کامل

Managing Uncertainty within Value Function Approximation in Reinforcement Learning

The dilemma between exploration and exploitation is an important topic in reinforcement learning (RL). Most successful approaches in addressing this problem tend to use some uncertainty information about values estimated during learning. On another hand, scalability is known as being a lack of RL algorithms and value function approximation has become a major topic of research. Both problems ari...

متن کامل

Reactive Max-min Ant System: an Experimental Analysis of the Combination with K-opt Local Searche

Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. The exploration versus exploitation dilemma rises in ACO search. Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation. It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary explora...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009